K-Means Algorithm Analysis for Election Cluster Prediction

نویسندگان

چکیده

The general election is a democratic process that carried out in every country whose system of government presidential, including Indonesia, which conducts it five years. In fact, some people abstain, leading to budget wasting and missing target. Thus, very important identify clusters districts map the number voters for upcoming election. This needs prediction help reduce budgeting risk as an early warning. Based on latest data taken from Margokaton, Yogyakarta, many voted 2021, but abstainers high. this case, cluster participants each area. K-Means algorithm could also predict abstainer areas activities facilitate mitigation drafting budgeting. Therefore, study aimed pattern using K-means algorithm. parameters comprised list voters, Unused ballot papers, sum abstainers. because contributes reducing obtained Indonesia Ministry Internal Affairs official website 2021 were processed RapidMiner tool. results showed more than 11% non-voters 1, 16% Cluster 2, 8% 3. evaluation value 2.04, indicating clustering suitable, shown by DBI close 0. indicate testing optimization highly recommended. result, special attention with decrease prevent overbudgeting. These need review participant 2024. Furthermore, there continuous socialization education about

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid K-means Algorithm and Genetic Algorithm for Cluster Analysis

Cluster analysis is a fundamental technique for various filed such as pattern recognition, machine learning and so forth. However, the cluster number is predefined by users in K-means algorithm, which is unpractical to implement. Since the number of clusters is a NP-complete problem, Genetic Algorithm is employed to solve it. In addition, due to the large time consuming in conventional method, ...

متن کامل

K-Means Cluster Analysis for Image Segmentation

Does K-Means reasonably divides the data into k groups is an important question that arises when one works on Image Segmentation? Which color space one should choose and how to ascertain that the k we determine is valid? The purpose of this study was to explore the answers to aforementioned questions. We perform K-Means on a number of 2-cluster, 3cluster and k-cluster color images (k>3) in RGB ...

متن کامل

Crime Prediction using K-means Algorithm

Crime analysis and prevention is a systematic approach for identifying and analyzing patterns and trends in crime. Our system can predict regions which have high probability for crime occurrence and can visualize crime prone areas. With the increasing advent of computerized systems, crime data analysts can help the Law enforcement officers to speed up the process of solving crimes. About 10% of...

متن کامل

Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm

Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...

متن کامل

Fast modified global k-means algorithm for incremental cluster construction

The k-means algorithm and its variations are known to be fast clustering algorithms. However, they are sensitive to the choice of starting points and are inefficient for solving clustering problems in large datasets. Recently, incremental approaches have been developed to resolve difficulties with the choice of starting points. The global k-means and the modified global k-means algorithms are b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JOIV : International Journal on Informatics Visualization

سال: 2023

ISSN: ['2549-9610', '2549-9904']

DOI: https://doi.org/10.30630/joiv.7.1.1107